A parallel decomposition algorithm for training multiclass kernel-based vector machines

نویسندگان

  • Lingfeng Niu
  • Ya-Xiang Yuan
چکیده

A parallel decomposition algorithm for training multiclass kernel-based vector machines Lingfeng Niu a b & Ya-Xiang Yuan b a Research Center on Fictitious Economy and Data Science, Graduate University of Chinese Academy Sciences, AMSS, CAS, Beijing, 100190, People's Republic of China b State Key Laboratory of Scientific and Engineering Computing, Institute of Computational Mathematics and Scientific/ Engineering Computing, AMSS, CAS, Beijing, 100190, People's Republic of China

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Identifying Efficient Kernel Function in Multiclass Support Vector Machines

Support vector machine (SVM) is a kernel based novel pattern classification method that is significant in many areas like data mining and machine learning. A unique strength is the use of kernel function to map the data into a higher dimensional feature space. In training SVM, kernels and its parameters have very vital role for classification accuracy. Therefore, a suitable kernel design and it...

متن کامل

On the Algorithmic Implementation of Multiclass Kernel-based Vector Machines

In this paper we describe the algorithmic implementation of multiclass kernel-based vector machines. Our starting point is a generalized notion of the margin to multiclass problems. Using this notion we cast multiclass categorization problems as a constrained optimization problem with a quadratic objective function. Unlike most of previous approaches which typically decompose a multiclass probl...

متن کامل

Efficient Implementation of Serial and Parallel Support Vector Machine Training with a Multi-Parameter Kernel for Large-Scale Data Mining

This work deals with aspects of support vector learning for large-scale data mining tasks. Based on a decomposition algorithm that can be run in serial and parallel mode we introduce a data transformation that allows for the usage of an expensive generalized kernel without additional costs. In order to speed up the decomposition algorithm we analyze the problem of working set selection for larg...

متن کامل

On the Efficient Implementation of a Serial and Parallel Decomposition Algorithm for Fast Support Vector Machine Training Including a Multi-Parameter Kernel

This work deals with aspects of support vector machine learning for large-scale data mining tasks. Based on a decomposition algorithm for support vector machine training that can be run in serial as well as shared memory parallel mode we introduce a transformation of the training data that allows for the usage of an expensive generalized kernel without additional costs. We present experiments f...

متن کامل

Fast n-Fold Cross-Validation for Regularized Least-Squares

Kernel-based learning algorithms have recently become the state-of-the-art machine learning methods of which the support vector machines are the most popular ones. Regularized least-squares (RLS), another kernel-based learning algorithm that is also known as the least-squares support vector machine, is shown to have a performance comparable to that of the support vector machines in several mach...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Optimization Methods and Software

دوره 26  شماره 

صفحات  -

تاریخ انتشار 2011